|
|
Ray Tracing Using k-D Tree
Šilhavý, Miroslav ; Herout, Adam (referee) ; Havel, Jiří (advisor)
This thesis deals with ray tracing methods and their acceleration. It gives partial study and review of algorithms from classical ray shooting algorithm to recursive approach up to distributed ray tracing algorithm. Significant part of this thesis is devoted to BSP tree structure and its subclass of k-D tree, it shows simple algorithm for its construction and traversal. The rest of thesis is dealing with k-D tree construction techniques, which are based on the right choice of the splitting plane inside the every cell of k-D tree. The techniques upon the thesis is based on are space median, object median and relatively new cost model technique named SAH, otherwise as surface area heuristic. All three techniques are put into testing and performance comparison. In the conclusion the results of tests are reviewed, from where SAH is coming out as a winner.
|
|
|
Demonstration of an Indexing Algorithm kD Tree and Its Derivatives
Foukal, Tomáš ; Květoňová, Šárka (referee) ; Kolář, Dušan (advisor)
This thesis deals with analysis, designing and implementation of an application for teaching of indexing algorithm kD Tree and its derivates. Also, it deals with testing the application, describing of its use and including examples with exact data. Application as well offers a~possibility of running of algorithms step-by-step and their visualization with a graphical user interface. During development, the emphasis was on executability of the application in all major web browsers.
|
|
|
Demonstration of an Indexing Algorithm kD Tree and Its Derivatives
Foukal, Tomáš ; Květoňová, Šárka (referee) ; Kolář, Dušan (advisor)
This thesis deals with analysis, designing and implementation of an application for teaching of indexing algorithm kD Tree and its derivates. Also, it deals with testing the application, describing of its use and including examples with exact data. Application as well offers a~possibility of running of algorithms step-by-step and their visualization with a graphical user interface. During development, the emphasis was on executability of the application in all major web browsers.
|
|
|
Tool for Designing Procedural Textures
Číž, Miloslav ; Polok, Lukáš (referee) ; Milet, Tomáš (advisor)
This thesis deals with implementation of a program library for designing and generating two-dimensional procedural textures and its GUI supportive tool. Attention was paid to common methods as well as to other computer graphics areas with effort for modifying the algorithms in order to achieve unique results. An effective way of texture representation and its concrete implementation is also presented.
|
|
|
Ray Tracing Using k-D Tree
Šilhavý, Miroslav ; Herout, Adam (referee) ; Havel, Jiří (advisor)
This thesis deals with ray tracing methods and their acceleration. It gives partial study and review of algorithms from classical ray shooting algorithm to recursive approach up to distributed ray tracing algorithm. Significant part of this thesis is devoted to BSP tree structure and its subclass of k-D tree, it shows simple algorithm for its construction and traversal. The rest of thesis is dealing with k-D tree construction techniques, which are based on the right choice of the splitting plane inside the every cell of k-D tree. The techniques upon the thesis is based on are space median, object median and relatively new cost model technique named SAH, otherwise as surface area heuristic. All three techniques are put into testing and performance comparison. In the conclusion the results of tests are reviewed, from where SAH is coming out as a winner.
|
guest ::
